The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex
نویسنده
چکیده
We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain results on succinctness and expressiveness in these two settings. Our proofs are based on formula size games introduced by Adler and Immerman and bisimulations.
منابع مشابه
On the relative succinctness of modal logics with union, intersection and quantification
In the study of knowledge representation formalisms, there is a current interest in the question of how different formal languages compare in their ability to compactly express semantic properties. Recently, French et al. [9] have shown that modal logics with a modality for public announcement, for everybody knows, and for somebody knows are all exponentially more succinct than basic modal logi...
متن کاملThe succinctness of first-order logic on linear orders (Full Version)
Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L1 is more succinct than another logic L2 if all properties that can be expressed in L2 can be expressed in L1 by formulas of (approximately) the same size, but some properties can be expressed in L1 by (significantly) smaller formulas. We study the succinctness of logics on linear orders that...
متن کاملInterpolation in Algebraizable Logics; Semantics for Non-normal Multi-modal Logic
The two main directions pursued in the present paper are the following. The rst direction was (perhaps) started by Pigozzi in 1969. In Mak 91] and Mak 79] Maksimova proved that a normal modal logic (with a single u-nary modality) has the Craig interpolation property ii the corresponding class of algebras has the superamalgamation property. In this paper we extend Maksimova's theorem to normal m...
متن کاملOn the succinctness of some modal logics
Article history: Received 24 February 2012 Received in revised form 12 February 2013 Accepted 16 February 2013 Available online 18 February 2013
متن کاملOn the Relative Succinctness of Two Extensions by Definitions of Multimodal Logic
The growing number of logics has lead to the question: How do we compare two formalisms? A natural answer is: We can compare their expressive power and computational properties. There is, however, another way of comparing logics that has attracted attention recently, namely in terms of representational succinctness, i.e., we can ask whether one of the logics allows for a more “economical” encod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1410.5993 شماره
صفحات -
تاریخ انتشار 2014